Two Algorithms for Solving the Walrasian Equilibrium Inequalities

Decision Methods for Solving Systems of Walrasian Inequalities

We propose two algorithms for deciding if systems of Walrasian inequalities are solvable. These algorithms may serve as nonparametric tests for multiple calibration of applied general equilibrium models or they can be used to compute counterfactual equilibria in applied general equilibrium models defined by systems of Walrasian inequalities.

APPROXIMATE SOLUTIONS OF THE WALRASIAN AND GORMAN POLAR FORM EQUILIBRIUM INEQUALITIES By

Recently Cherchye et al. (2011) reformulated the Walrasian equilibrium inequalities, introduced by Brown and Matzkin (1996), as an integer programming problem and proved that solving the Walrasian equilibrium inequalities is NP-hard. Following Brown and Shannon (2000), we reformulate the Walrasian equilibrium inequalities as the dual Walrasian equilibrium inequalities. Brown and Shannon proved ...

APPROXIMATE SOLUTIONS OF THE WALRASIAN EQUILIBRIUM INEQUALITIES WITH BOUNDED MARGINAL UTILITIES OF INCOME By

Recently Cherchye et al. (2011) reformulated the Walrasian equilibrium inequalities, introduced by Brown and Matzkin (1996), as an integer programming problem and proved that solving the Walrasian equilibrium inequalities is NPhard. Brown and Shannon (2002) derived an equivalent system of equilibrium inequalities ,i.e., the dual Walrasian equilibrium inequalities. That is, the Walrasian equilib...

Iterative algorithms for families of variational inequalities fixed points and equilibrium problems

A Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems